Programming with Personalized PageRank: A Locally Groundable First-Order Probabilistic Logic William Yang Wang Kathryn Mazaitis

Source URL: www.cs.cmu.edu

• Logic
• Philosophy
• Crowdsourcing
• Google Search
• PageRank
• Reputation management
• Search engine optimization
• Markov logic network
• Probabilistic logic
• Markov random field
• Inference
• Substitution

PDF Document

Source URL: web.stanford.edu

• Machine learning
• Mathematical analysis
• Learning
• Artificial intelligence
• Search algorithms
• Dimension reduction
• Statistical classification
• MinHash
• Nearest neighbor search
• Random projection
• K-nearest neighbors algorithm
• Dimensionality reduction

Continuous Arvand: Motion Planning with Monte Carlo Random Walks ¨ Weifeng Chen and Martin Muller Department of Computing Science University of Alberta {weifeng3,mmueller}@ualberta.ca

Source URL: webdocs.cs.ualberta.ca

• Statistics
• Applied mathematics
• Search algorithms
• Stochastic processes
• Motion planning
• Rapidly-exploring random tree
• Random walk
• Probabilistic roadmap
• Urban planning
• Theoretical computer science
• Robot control
• Geography of Asia

PageRank and random walks on graphs Fan Chung and Wenbo Zhao University of California, San Diego La Jolla, CA 92093, US {fan,pedu,w3zhao}@ucsd.edu

Source URL: www.math.ucsd.edu

• Matrix theory
• PageRank
• Reputation management
• Search engine optimization
• Tree
• Eigenvalues and eigenvectors
• Theorems and definitions in linear algebra
• Covering graph
• Algebra
• Mathematics
• Linear algebra

S OME R ESEARCH T OPICS FOR S TUDENTS Quentin F. Stout Here’s a quick overview of some research topics I’m interested in. I’ve also worked with many students that initiated their own project. If yo

Source URL: web.eecs.umich.edu

• Parallel computing
• Spanning tree
• Analysis of algorithms
• Search algorithms
• Parallel algorithm
• Algorithm
• Genetic algorithm
• Parallel Random Access Machine
• Minimum spanning tree
• Theoretical computer science
• Concurrent computing
• Applied mathematics

(Activity sheet for Shivery Shades of Halloween by Mary McKenna Siddals, illustrated by Jimmy Pickering © 2014 Random House) Spooky Color Word Search e d

Source URL: www.siddals.com

REPORTS sion, the network ties become less correlated as H increases. In the limit of large H, the network becomes essentially a random graph (regardless of ␣) and the search algorithm becomes a random walk. An effecti

Source URL: www.univie.ac.at

RANDOM SEARCH IN AUTOMATIC FONT GENERATION Luc Devroye and Sandro Mazzucato School of Computer Science, McGill University, Montreal, Canada Abstract. We present a method for creating a PostScript type one B´ezier outl

Source URL: luc.devroye.org

RANDOM THOUGHTS ON HOW GIRL SCOUTING CAN HELP CONGREGATIONS DEVELOP ASSETS IN YOUTH Developmental Asset [Copyright ©1997 by Search Institute, 700 S 3rd St., Ste

Source URL: www.praypub.org

(Activity sheet for Shivery Shades of Halloween by Mary McKenna Siddals, illustrated by Jimmy Pickering © 2014 Random House) *** Spooky Color Word Search *** t e

Source URL: www.siddals.com